Maximal and Maximum Transitive Relation Contained in a Given Binary Relation
نویسندگان
چکیده
We study the problem of finding a maximal transitive relation contained in a given binary relation. Given a binary relation of size m defined on a set of size n, we present a polynomial time algorithm that finds a maximal transitive sub-relation in time O(n + nm). We also study the problem of finding a maximum transitive relation contained in a binary relation. For the class of triangle-free relations (directed graphs), we present a 0.874-approximation via the problem of maximum directed cut.
منابع مشابه
Fuzzy number-valued fuzzy relation
It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...
متن کاملFinding Close T-indistinguishability Operators to a Given Proximity
Two ways to approximate a proximity relation R (i.e. a reflexive and symmetric fuzzy relation) by a T -transitive one where T is a continuous archimedean t-norm are given. The first one aggregates the transitive closure R of R with a (maximal) T -transitive relation B contained in R. The second one modifies the values of R or B to better fit them with the ones of R.
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملA New Algorithm to Compute Low T-Transitive Approximation of a Fuzzy Relation Preserving Symmetry. Comparisons with the T-Transitive Closure
It is given a new algorithm to compute a lower T-transitive approximation of a fuzzy relation that preserves symmetry. Given a reflexive and symmetric fuzzy relation, the new algorithm computes a T-indistinguishability that is contained in the fuzzy relation. It has been developed a C++ program that generates random symmetric fuzzy relations or random symmetric and reflexive fuzzy relations and...
متن کاملON FINITE GROUPS IN WHICH SS-SEMIPERMUTABILITY IS A TRANSITIVE RELATION
Let H be a subgroup of a finite group G. We say that H is SS-semipermutable in Gif H has a supplement K in G such that H permutes with every Sylow subgroup X of Kwith (jXj; jHj) = 1. In this paper, the Structure of SS-semipermutable subgroups, and finitegroups in which SS-semipermutability is a transitive relation are described. It is shown thata finite solvable group G is a PST-group if and on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015